Router with class of service mapping

ABSTRACT

A router includes a classifier that classifies packets assigned to 2 n−m  classes of service into 2 n  classes of service that are supported by the router. The classifier then sets the loss priorities of the respective packets to one of m levels. The router uses a modified weighted random early detection scheme that is based on probabilities of discard associated with the 2 n+m  classes of service to determine whether to retain or discard particular packets. The router uses a single buffer to store packets directed to all of the various output ports. The available storage locations in the buffer are linked to a free queue and a weighted average depth of the free queue, is used to determined whether or not to retain a given packet. The router compares the weighted average depth of the free queue to maximum and minimum thresholds associated with the particular 2 n+m  class of service to which the packet is assigned. If the weighted average is above the maximum threshold, the packet is retained. If the weighted average is below the minimum threshold, the packet is discarded. If the weighted average is between the two thresholds, a probability of discard that is based on the 2 n+m  classes of service is calculated and compared to a random value to determine whether or not the packet should be retained. If the probability of discard exceeds the random value, the packet is discarded. The other packets exit various output ports of the router based on weighting factors associated with the 2 n  classes of service.

FIELD OF INVENTION

The invention relates generally to routers and switches and, more particularly, to routers and switches that support multiple classes of service for packet routing.

BACKGROUND OF THE INVENTION

At network multiplexing points, such as switches or routers, the handling of frames or packets is generally determined by rules associated with classes of service to which given frames or packets are assigned. The classes of service essentially define acceptable packet or frame delays and probabilities of packet or frame loss. (As used herein, the term “packet” refers to both frames and packets, and the term “router” refers to both switches and routers.)

The packets are typically assigned to classes of service based on information contained in the packet and/or traffic management rules established by either a network supervisor or a service provider. All packets assigned to the same class receive the same treatment. Being assigned to a “higher” class ensures that a packet will have a shorter maximum transmission delay and a lower probability of loss. Being assigned to a “lower” class may mean a longer delay and/or a greater probability of loss.

Generally, the router maintains at each output port a buffer for holding packets in queues associated with the classes of service. The queues ensure that packets are delivered in order within the various classes of service, and that the associated rules for maximum delays and probabilities of loss can be enforced. Since each queue is essentially separately maintained, the more classes the router supports the more processing and storage capacity is required for a given number of output ports. To support “x” classes, for example, the router must set aside buffer storage locations for each of the x queues at each of its “y” ports. Further, it must determine for each queue whether or not a next packet should be retained or discarded. The router thus makes x*y separate calculations based on queue length and/or available associated storage locations to determine whether to retain or discard the packets, where “*” represents multiplication.

Network standards, such as the (revised) 802.1p standard, have relatively recently increased the number of classes of service to eight classes. Routers operating under prior standards support four classes of service, and thus, must be upgraded, for example, with increased storage capacities of the output port buffers, to support the increased number of classes. Such upgrading may be prohibitively expensive and/or it may not be feasible. Accordingly, what is needed is a mechanism to operate a router that supports a relatively small number of classes of service in an environment in which packets are assigned to a greater number of classes. Such a mechanism should, without requiring the enlarged storage and processing capabilities conventionally associated with supporting the greater number of classes, maintain service distinctions associated with the greater number of classes and more importantly retain the order of packets within each of the greater number of classes.

SUMMARY OF THE INVENTION

A router maps packets assigned to 2^(n+m) classes of service into 2^(n) classes of service and assigns the packets to 2^(m) levels of loss-priority within each of the 2^(n) classes. The router includes a classifier that uses n bits of an (n+m)-bit “class of service identifier” to map the packets to the 2^(n) classes, and the remaining m bits to assign the loss priorities. The router then controls packet retention/discard with a modified weighted random early detection scheme based in part on the 2^(n+m) classes and in part on the 2^(n) classes, to maintain the probability of loss distinctions and in-order packet handling associated with the 2^(n+m) classes.

A scheduler controls the transmission of packets by each output port based on the 2^(n) classes of service. The scheduler uses a weighted round robin scheme to ensure that packets from each of the classes are transmitted by each of the output ports within the prescribed maximum delay limits associated with the 2^(n+m) classes of service.

The router includes an output buffer that holds the packets for all of the router's output ports. The router maintains a “free queue,” which links the buffer storage locations available for packet storage. To determine whether to retain or discard a given packet, the router compares a weighted average depth of the free queue with predetermined maximum and minimum thresholds that are associated with the particular one of the 2^(n+m) classes of service to which the packet is assigned. If the weighted average exceeds the associated maximum threshold, the router retains the packet in a storage location that is then removed from the free queue and linked to a class of service per output port queue that corresponds to the class of service to which the packet is mapped by the classifier. If the weighted average depth falls below the associated minimum threshold, the router discards the packet. If the weighted average depth falls between the associated minimum and maximum thresholds, the router calculates a probability of discard and compares the probability to a “random” value. The router discards the packet if the probability exceeds the random value, and otherwise retains the packet.

The maximum and minimum thresholds are set relative to one another such that the loss priorities associated with the 2^(n+m) classes are maintained. As discussed below, the router makes only one weighted average queue depth calculation for the free queue, and uses this calculation to determine whether to retain or discard packets for the 2^(n) classes of service. This is in contrast to prior known routers that must maintain at each output port separate average queue depths for each of the class of service per port queues.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention description below refers to the accompanying drawings, of which:

FIG. 1 is a functional block diagram of a network that includes routers that are constructed and operate in accordance with the invention;

FIG. 2 is a functional block diagram of a router of FIG. 1;

FIG. 3 illustrates a mapping of packets to classes of service;

FIG. 4 is a flow chart of the operations of the router of FIG. 2; and

FIG. 5 is a graph of weighted average queue depth versus probability of packet discard.

DETAILED DESCRIPTION OF AN ILLUSTRATIVE EMBODIMENT

Referring now to FIG. 1, a network 10 includes a plurality of endstations 12 and nodes 14 that transmit packets to other endstations 12 and nodes 14 through routers 16 and 17. The endstations 12 and nodes 14 assign packets to classes of service based on information contained in the packets and/or on predetermined traffic management rules that are provided by the network manager and/or various service providers. The classes of service are essentially associated with maximum limits for transmission delays and probabilities of packet loss. Higher classes are associated with shorter maximum delays and lower probabilities of packet loss. Packets that must be delivered as essential parts of a transmission are, for example, assigned to a higher class than are packets that contain non-essential information.

Preferably, the endstation 12 or the node 14 that introduces the packet to the network assigns the packet to one of 2^(n+m) classes of service. To inform the routers 16 and 17 of the assignment, the endstation 12 or node 14 writes an appropriate class of service (COS) “tag” to a COS identifier field in the header that is included in the packet. The COS identifier field has three bits, as defined by (revised) standard 802.1p, and the packet is thus assigned to one of eight classes of service, i.e., 1 of 2³ classes. The packet is then forwarded by the endstation 12 or node 14 over the network 10 to an input port 28 of a router 16 or 17. The router then transfers the packet through an output port 30 and over the network in accordance with the transmission rules and delay limits associated with the class of service to which the packet is assigned.

The routers 17 support 2^(n+m) classes of service while the routers 16 support 2^(n) classes, where n<3. We discuss herein the operations of the routers 16 to assign packets to the various classes. Further, we discuss the operations that the routers 16 and/or the routers 17 perform to determine whether to retain or discard a packet and/or when to transmit a packet.

Referring now to FIG. 2, a router 16 includes a classifier 18 that associates a received packet with one of 2^(n+m) classes of service, based primarily on the COS tag, if any, included in the packet header. The classifier maps the 2^(n+m) classes of service to the 2^(n) classes based on, for example, the highest order n bits or the lowest order n bits of the COS tag. The classifier then uses the remaining bits of the COS tag to set the loss priorities of the packets. As discussed below, the loss priorities determine if respective packets are discarded or retained during times of congestion. The higher the loss priority of a packet, the less likely the packet will be retained.

If the endstation 12 or node 14 that introduces the packet to the network does not support the 802.1p standard, the COS tag may not be included in the packet. The classifier 18 may then assign the packet to one of the 2^(n+m) classes, currently 2³ classes, based on appropriate network or service provider transmission rules. It may, for example, assign the packet to a “best effort” class. Alternatively, the router 16 may assign the packet to a particular class of service based on a media access control, or MAC, address included in the packet. The classifier then writes the appropriate COS tag to the packet header.

Referring now also to FIG. 3, the router 16 in this exemplary embodiment supports four classes of service, i.e., 2² classes. The classifier 18 maps each of the 2³ classes of service to an appropriate one of the 2² classes of service based on the two highest order bits of the 3-bit COS tag. The third, or lowest order bit, is then used to assign a loss priority to the packet. The classifier 18 thus associates a packet that is assigned to class of service 010 with class of service 01 and sets the loss priority of the packet to 0. Further, the classifier 18 associates a packet that is assigned to class of service 011 with class 01 and sets the loss priority of this packet to 1.

Referring further to FIG. 4 once the classifier 18 associates the packets with the various 2^(n) classes of service and sets the loss priorities (steps 400-402), a policer 20 enforces network or service provider usage parameter controls by marking, discarding or passing the packets (step 404). The usage parameter controls are set by a network manager or service provider based on, for example, levels of service purchased by or associated with a user. The user may, for example, purchase a level of service based on the transmission of a maximum number of packets per hour. If the number of packets being sent by the user exceeds this limit, the policer then marks, discards or passes the excess packets depending on the traffic management rules.

If the policer 20 marks an offending packet, it assigns the packet to a higher loss priority within the associated class of service. This increases the likelihood that the packet will be discarded if the network becomes congested. In the example, the policer sets the lowest order bit of the COS tag to 1. If the packet is already assigned the highest loss priority within the class of service, the policer 20 either passes or discards the packet, depending on the traffic management rules. If the packet is passed, the policer 20 may charge the user for the use of excess bandwidth.

As discussed above, the policer 20 operates in accordance with traffic management rules established by a network manager or service provider. In the embodiment described herein the policer determines if a packet exceeds an established limit by using a “jumping window policing scheme.” The policer thus sets a police rate of B/T for a user, where B is a burst size and T is a time interval and both B and T are set by the network manager or service provider. The policer then counts the number of octets received from the user over intervals of length T. If the count exceeds B, the arriving packet is marked, passed or dropped, depending on the enforcement mode utilized by the policer. Various limits may be set, such as, for example, limits that vary based on the number of times the associated policing rate is exceeded by a given user and/or based on the various classes of service.

A WRED processor 22 determines which of the remaining packets, i.e., the packets that the policer has not discarded, are to be retained in a buffer 24 that holds the packets for every output port 30 (steps 406-416). The use of a single buffer is in contrast to prior known routers that use a separate buffer for each output port.

The WRED processor 22 utilizes a modified weighted-random early detection (WRED) scheme. The WRED processor associates with each of the 2^(n+m) classes of service, “C_(i),” two thresholds, namely, a maximum threshold MAX_(C) _(i) and a minimum threshold MIN_(C) _(i) . As discussed below, the thresholds are used by the processor 22 to determine whether to retain or discard a given packet.

The WRED processor 22 keeps track of an average “free queue” depth, which is an average number of available storage locations in the buffer 24. When the buffer is empty, all of the buffer storage locations are linked to the free queue. As packets are retained, buffer locations, which are generally referred to in 512 byte pages, are removed from the free queue and linked to appropriate class of service per output port queues. When the packets are later transmitted, the buffer locations are removed from the class of service per output port queues and again linked to the free queue.

Each time a packet is received, the WRED processor 22 determines a new weighted average free queue depth A_(NEW):

A _(NEW) =A _(CURRENT) +W(I−A _(CURRENT))

where I is the instantaneous size of the free queue, W is the weighting factor and A_(CURRENT) is the current weighted average free queue depth (step 406). The weighting factor W is preferably selected such that multiplication is accomplished by shifting the difference value (I−A_(CURRENT)). The value A_(CURRENT) is updated at regular intervals with the value of A_(NEW,) such as after every 64B frame time, which approximates the average packet arrival time.

The WRED processor compares the weighted average A_(NEW) with the MAX_(C) _(i) and MIN_(C) _(i) values associated with the appropriate one of the 2^(n+m) classes of service. If the weighted average exceeds the MAX_(C) _(i) value, the WRED processor 22 retains the packet (step 408). If the weighted average falls below the MIN_(C) _(i) value, the WRED processor 22 discards the packet (step 410). If, however, the average falls between MAX_(C) _(i) and MIN_(C) _(i) values, the WRED processor calculates a probability of discard, PD:

P _(D) =b _(c) _(i) −(m _(c) _(i) *A _(NEW))

where b_(c) _(i) and m_(c) _(i) are the intercept and slope values associated with the appropriate one of the 2^(n+m) classes of service (step 412). As shown in FIG. 5, the probability of discard changes linearly with changes in the weighted average queue depth. A given packet is discarded when the probability of discard P_(D) exceeds a “random” number that is produced by a pseudo random generator 25 (steps 414-416). When the weighted average is relatively low, the probability of discard is larger, and thus, the packet is more likely to be discarded.

The slope and intercept values m_(c) _(i) and b_(c) _(i) are selected based on trade-offs between keeping links through the router 16 busy and reserving space in the buffer 24 to handle bursts. For higher classes of service the slope and intercept values are selected to be relatively low—such that the probability of discard is low over the entire range from MAX_(c) _(i) to MIN_(c) _(i) . The slope and intercept values for the lower classes of service are typically larger, reflecting the greater associated probability of packet loss for the class and the reservation of spaces in the buffer for bursts of packets assigned to the higher classes. The various threshold values, and slope and intercept values are selected such that packet order and probabilities of packet loss are maintained across the 2^(n+m) classes of service.

In prior known routers, implementing a WRED scheme required maintaining average queue depths for all of the classes of service queues at each of the output ports. Thus, for a router to support 8 classes of service over “y” output ports, it had to calculate average queue depths for 8*y separate queues. In the current router 16, the WRED processor calculates the average depth of a single free queue, regardless of the number of classes of service.

A scheduler 26 implements a 2^(n) class-based weighted round robin (WRR) scheduling scheme for each output port (step 418). The scheduler associates an appropriate weighting factor W_(Q) _(j) with each class of service per output port queue. The scheduler de-queues W_(Q) _(j) packets for transfer from the Q_(j) queue associated with one of the 2^(n) classes of service, and then de-queues W_(Q) _(j+1) packets from the Q_(j+1) queue for subsequent transfer. If the Q_(j+1) queue is empty, the scheduler de-queues an appropriate number of packets from the Q_(j+2) queue, and so forth. The scheduler 26 thus ensures that each one of the 2^(n) classes of service is associated with an appropriate maximum delay limit and through-put allocation.

The class of service mapping, modified WRED scheme and WRR scheme in combination ensure that packets are transferred through the router 16 as if the router supported the 2^(n+m) classes of service. The router 16, however, requires less processing and storage overhead than the prior known routers that support the same number of classes, since the router 16 actually supports 2^(n) classes of service, and uses a single output buffer to do so. 

What is claimed is:
 1. A router for use in routing packets over a network, the router supporting a plurality, X, of classes of service and including: A. a plurality of input ports for receiving packets over the network; B. a plurality of output ports for transferring packets over the network; C. a classifier for assigning packets received by the input ports to X*Y classes of service, where * represents multiplication, and mapping the XY classes of service to the X classes of service that are supported by the router, the classifier assigning to the packet one of Y associated levels of priority, wherein each level of priority is associated with a different probability of packet loss; D. means for retaining the packets based on probabilities of discard associated with the X*Y classes of service; and E. scheduling means for transferring the packets through each of the output ports based on the X classes of service.
 2. The router of claim 1 further including a multiple storage location buffer for retaining packets to be transferred through the output ports, the buffer linking the storage locations that contain packets in class of service per output port queues and linking available storage locations in a free queue.
 3. The router of claim 2 wherein the means for retaining the packets further includes: i. means for determining a new weighted average depth for the free queue, and ii. means for determining a probability of discard for a given packet if the new weighted average queue depth falls below a predetermined maximum threshold associated with the class of service to which the packet is assigned.
 4. The router of claim 3 wherein the means for retaining the packets discards a given packet if the associated weighted average depth for the free queue falls below a minimum threshold associated with the class of service to which the packet is assigned.
 5. The router of claim 4 wherein the means for retaining the packets calculates the probability of discard as P_(d)=c−(m*A_(NEW)) where c is an intercept and m is a slope that is associated with a line that plots a weighted average free queue depth versus probability of discard for the class of service to which the packet is assigned, and A_(NEW) is the weighted average depth of the free queue.
 6. The router of claim 5 wherein the means for retaining the packets calculates the new weighted average depth of the free queue as A_(NEW)=A_(CURRENT)+w(I−A_(CURRENT)) where w is a weighting factor, I represents the instantaneous depth of the free queue and A_(CURRENT) is the current weighted average depth of the free queue.
 7. The router of claim 6 wherein the scheduling means selects packets for transfer based on weighting factors associated with the respective X classes of service.
 8. The router of claim 1 wherein the router supports X=2^(n) classes of service and the classifier assigns packets to X*Y=2^(n+m) classes of service.
 9. A router for use in routing packets over a network, the router supporting a plurality, X, of classes of service and including: A. a plurality of input ports for receiving packets over the network; B. a plurality of output ports for transferring packets over the network; C. a multiple storage location buffer for retaining packets to be transferred through the output ports; D. means for retaining the packets based on probabilities of discard associated with X*Y classes of service where * represents multiplication; and E. scheduling means for transferring the packets through each of the output ports based on the X classes of service that the router supports.
 10. The router of claim 9 further including a classifier for: i. assigning packets received by the input ports to X*Y classes of service, ii. associating the packets with the X classes of service that are supported by the router, and iii. assigning to the packet one of Y associated levels of priority, wherein each level of priority is associated with a different probability of packet loss.
 11. The router of claim 10 wherein the means for retaining the packets further includes i. means for determining a new weighted average queue depth for a free queue that links available buffer storage locations, and ii. means for determining a probability of discard for a given packet if the new weighted average free queue depth falls below a predetermined maximum threshold associated with the class of service to which the packet is assigned.
 12. the router of claim 11 wherein the means for retaining the packets calculates the probability of discard as P_(d)=c−(m*A_(NEW)) where c is an intercept and m is a slope that are associated with a line that plots a weighted average free queue depth versus probability of discard for the class of service to which the packet is assigned, and A_(NEW) is the weighted average depth of the free queue.
 13. The router of claim 12 wherein the means for retaining the packets calculates the weighted average depth of the free queue as A_(NEW)=A_(CURRENT)+w(I−A_(CURRENT)) where w is a weighted factor, I represents the instantaneous depth of the free queue and A_(CURRENT)) is the current weighted average depth of the free queue.
 14. The router of claim 13 wherein the means for retaining the packets discards a given packet if the new weighted average free queue depth falls below a minimum threshold associated with the class of service to which the packet is assigned.
 15. The router of claim 13 wherein the means for retaining the packets retains a given packet if the new weighted average free queue depth is above a maximum threshold associated with the class of service to which the packet is assigned.
 16. The router of claim 9 wherein the scheduling means selects packets for transfer through each output port based on weighting factors associated with the respective X classes of service.
 17. The router of claim 16 wherein the buffer links retained packets in class of service per output port queues and the scheduling means selects packets from the class of service per output port queues.
 18. The router of claim 9 wherein the router supports X=2^(n) classes of service and the means for retaining retains packets bases on probabilities of discard associated with X*Y=2^(n+m) classes of service.
 19. A method of routing packets through a router that supports a plurality, X, of classes of service, the method including the steps of: A. receiving packets through one or more input ports; B. assigning packets received by the input ports to X*Y classes of service, where * represents multiplication, mapping the X*Y classes of service to the X classes of service that are supported by the router, and assigning to the packet one of Y associated levels of priority, wherein each level of priority is associated with a different probability of packet loss; C. retaining the packets based on probabilities of discard associated with the X*Y classes of service; and D. transferring the packets through one or more output ports based on the X classes of service. 20.The method of routing packets of claim 19 further including in the step of retaining the packets the steps of: i. retaining the packets in a multiple storage location buffer and linking available storage locations to a free queue, ii. determining a new weighted average depth for the free queue, and iii. determining a probability of discard for a given packet if the new weighted average queue depth falls below a predetermined maximum threshold associated with the class of service to which the packet is assigned.
 21. The method of routing packets of claim 20 including in the step of retaining the packets the further step of discarding a given packet if the new weighted average depth for the free queue falls below a minimum threshold associated with the class of service to which the packet is assigned.
 22. The method of routing packets of claim 21 wherein the step of retaining the packets includes calculating the probability of discard as P_(d)=c−(m*A_(NEW)) where c is an intercept and m is a slope associated with a line that plots weighted average free queue depth versus probability of discard for the class of service to which the packet is assigned, and A_(NEW) is the new weighted average depth of the free queue.
 23. The method of routing packets of claim 22 wherein the step of retaining the packets includes calculating the new weighted average depth of the free queue as A_(NEW)=A_(CURRENT)+w(I−A_(CURRENT)) where w is a weighting factor I represents the instantaneous depth of the free queue and A_(CURRENT) is the current weighted average queue depth.
 24. The method of claim 23 wherein the discard means retains a given packet of the new weighted average free queue depth is above a maximum threshold associated with the class of service to which the packet is assigned.
 25. The method of routing packets of claim 19 wherein the step of transferring packets through the more or more output port transfers the packets based on weighting factors associated with the respective X classes of service.
 26. The method of routing packets of claim 19 wherein the router supports X=2^(n) classes of service and, in the step of assigning packets, the packets are assigned to X*Y=2^(n+m) classes of service.
 27. A method of routing packets through a router that supports a plurality, X, of classes of service, the method including: A. receiving packets through one or more input ports and assigning the packets to X*Y classes of service, where * represents multiplication; B. retaining packets based on probabilities of discard associated with the X*Y classes of service in a multiple storage location buffer that links available storage locations to a free queue; and C. transferring the packets through one or more output ports based on the X classes of service.
 28. The method of routing of claim 27 further including the steps: i. associating the packets that are assigned to the X*Y classes of service with the X classes of service that are supported by the router, and ii. assigning to the respective packets one of Y associated levels of priority, wherein each level of priority associated with a different probability of packet loss.
 29. The method of routing packets of claim 28 wherein the step of retaining the packets includes: a. determining a new weighted average depth for the free queue, and b. determining a probability of discard for a given packet if the new weighted average free queue depth falls below a predetermined maximum threshold associated with the class of service to which the packet is assigned.
 30. The method of routing packets of claim 29 wherein the step of retaining packets further includes calculating the probability of discard as P_(d)=c−(m*A_(NEW)) where c is an intercept and m is a slope that are associated with a line that plots average free queue depth versus probability of discard for the class of service to which the packet is assigned, and A_(NEW) is the new weighted average depth of the free queue.
 31. The method of routing packets of claim 30 wherein the step of retaining packets further includes calculating the new weighted average depth of the free queue as A_(NEW)=A_(CURRENT)+w(I−A_(CURRENT)) where w is a weighting factor, I represents the instantaneous depth of the free queue and A_(CURRENT) is the current weighted average queue depth.
 32. The method of routing packets of claim 29 wherein the step of retaining packets further includes discarding a given packet if the new weighted average free queue depth falls below a minimum threshold associated with the class of service to which the packet is assigned.
 33. The method of routing packets of claim 29 wherein the step of retaining packets further includes retaining a given packet if the new weighted average free queue depth is above the maximum threshold associated with the class of service to which the packet is assigned.
 34. The method of routing packets of claim 27 wherein the router supports X=2^(n) classes of service and, in the step of retaining packets, the packets are retained based on probabilities of discard associated with X*Y=2^(n+m) classes of service. 